An approximation algorithm for sorting by reversals and transpositions

Approximation Algorithm for Sorting by Reversals and Transpositions

Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a combinatorial problem of sorting by reversals and transpositions, the problem of finding a shortest sequence of reversals and transpositions that sorts one genome into the other. In this paper we present a (4 − 2 k )-approximat...

(1+ε)-approximation of Sorting by Reversals and Transpositions

This paper is concerned with the problem of sorting permutations using long range operations like inversions (reversing a segment) and transpositions (moving a segment). The problem comes from computational molecular biology, where the aim is to find a parsimonious rearrangement scenario that explains the difference in gene order between two genomes. In the late eighties, Palmer and Herbon [15]...

Sorting Strings by Reversals and by Transpositions

.375-approximation Algorithm for Sorting by Reversals

Analysis of genomes evolving by inversions leads to a general combina-torial problem of Sorting by Reversals, MIN-SBR, the problem of sorting a permutation by a minimum number of reversals. This combinatorial problem has a long history, and a number of other motivations. It was studied in a great detail recently in computational molecular biology. Following a series of preliminary results, Hann...

Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions

During evolution, genomes are subject to genome rearrangements that alter the ordering and orientation of genes on the chromosomes. If a genome consists of a single chromosome (like mitochondrial, chloroplast, or bacterial genomes), the biologically relevant genome rearrangements are (1) inversions--also called reversals--where a section of the genome is excised, reversed in orientation, and re...